On the Feasibility of Linear Discrete-Time Systems of the Green Scheduling Problem

Peak power consumption of buildings in large facilities like hospitals and universities becomes a big issue because peak prices are much higher than normal rates. During a power demand surge an automated power controller of a building may need to schedule ON and OFF different environment actuators such as heaters and air quality control while maintaining the state variables such as temperature or air quality of any room within comfortable ranges. The green scheduling problem asks whether a scheduling policy is possible for a system and what is the necessary and sufficient condition for systems to be feasible. In this paper we study the feasibility of the green scheduling problem for HVAC(Heating, Ventilating, and Air Conditioning) systems which are approximated by a discrete-time model with constant increasing and decreasing rates of the state variables. We first investigate the systems consisting of two tasks and find the analytical form of the necessary and sufficient conditions for such systems to be feasible under certain assumptions. Then we present our algorithmic solution for general systems of more than 2 tasks. Given the increasing and decreasing rates of the tasks, our algorithm returns a subset of the state space such that the system is feasible if and only if the initial state is in this subset. With the knowledge of that subset, a scheduling policy can be computed on the fly as the system runs, with the flexibility to add power-saving, priority-based or fair sub-policies

Architecture of a Cyberphysical Avatar

REACTION 2012. 1st International workshop on Real-time and distributed computing in emerging applications. December 4th, 2012, San Juan, Puerto Rico.This paper introduces the concept of a cyberphysical avatar which is defined to be a semi-autonomous robotic system that adjusts to an unstructured environment and performs physical tasks subject to critical timing constraints while under human supervision. Cyberphysical avatar integrates the recent advance in three technologies: body-compliant control in robotics, neuroevolution in machine learning and QoS guarantees in realtime communication. Body-compliant control is essential for operator safety since cyberphysical avatars perform cooperative tasks in close proximity to humans. Neuroevolution technique is essential for ”programming” cyberphysical avatars inasmuch as they are to be used by non-experts for a large array of tasks, some unforeseen, in an unstructured environment. QoS-guaranteed realtime communication is essential to provide predictable, boundedtime response in human-avatar interaction. By integrating these technologies, we have built a prototype cyberphysical avatar testbed

Incorporating Resource Safety Verification to Executable Model-based Development for Embedded Systems

This paper formulates and illustrates the integration of resource safety verification into a design methodology for development of verified and robust real-time embedded systems. Resource-related concerns are not closely linked with current xUML model-based software development although they are critical for embedded systems. We describe how to integrate resource analysis techniques into the early phase of an xUML-based development cycle. Our hybrid framework for resource safety verification combines static resource analysis and runtime monitoring. A case study based on an embedded controller for satellite simulation, TableSat, illustrates the benefits obtained by incorporating resource verification into design and combining static analysis and runtime monitoring. 1

Deriving Response-Time Bounds for Equational Rule-Based Programs

The response time of a rule-based program is defined as the maximum number of rule firings before a fixed point of the program is reached from a start state. In this paper, we present several principles which make use of two relations, potential-trigger and suppression, for deriving tight response-time bounds. While the computation of these two relations is costly in general, we show how they can be efficiently approximated by refining the necessary/sufficient conditions for these relations to be satisfied. A response-time analyzer based on the theories in this paper has been implemented to analyze programs whose potential-trigger relations are acyclic. We demonstrate the analysis process with an example program which has infinite state space. Our analyzer takes only seconds to derive a tight bound on the example program 's response time. 1 Introduction In recent years, there has been increasing interest in the use of rule-based programs in time-critical applications. In these applic..